Frontier: A Fast Placement System for FPGAs
نویسنده
چکیده
In this paper we describe Frontier, an FPGA placement system that uses design macro-blocks in conjuction with a series of placement algorithms to achieve highly-routable and high-performance layouts quickly. In the first stage of design placement, a macro-based floorplanner is used to quickly identify an initial layout based on inter-macro connectivity. Next, an FPGA routability metric, previously described in [14], is used to evaluate the quality of the initial placement. Finally, if the floorplan is determined to be unroutable, a feedback-driven placement perturbation step is employed to achieve a lower cost placement. For a collection of large reconfigurable computing benchmark circuits our placement system exhibits a 4× speedup in combined place and route time versus commercial FPGA CAD software with improved design performance for most designs. It is shown that floorplanning, routability evaluation, and back-end optimization are all necessary to achieve efficient placement solutions.
منابع مشابه
FAST I/O PAD PLACEMENT IN FPGAs
In VLSI physical design, a good placement of logic blocks along with the inputoutput blocks around the boundary of the chip can ensure good quality routing of the nets. Even after proper placement of the logic blocks, a random positioning of input-output blocks can result in inefficient and bad quality routing. Here we propose a placement algorithm GENERATE_PAD_FRAME for input-output blocks, fr...
متن کاملA New Non-linear Control of the Four-Leg Inverter with Decoupled Model and Fast Dynamic Response for PV Generation Systems
Distributed generation (DG) will play an important role in future power generation systems, especially in stand-alone applications. Three phase four-leg inverter is a well-known topology which can be used as an interface power converter for DGs. Thanks to the fourth leg to provide the neutral path, the four-leg inverter is able to supply balanced loads as well as unbalanced loads. In this paper...
متن کاملUltra-Fast Automatic Placement for FPGAs
Ultra-Fast Automatic Placement for FPGAs The demand for high-speed Field-Programmable Gate Array (FPGA) compilation tools has escalated for three reasons: first, as FPGA device capacity has grown, the computation time devoted to placement and routing of circuits has grown more dramatically than the available computer power. Second, there exists a subset of users who are willing to accept a redu...
متن کاملFast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing
Partial reconfiguration allows for mapping and executing several tasks on an FPGA during runtime. Multitasking on FPGAs raises a number of questions on the management of the reconfigurable resource which leads to the concept of a reconfigurable operating system. A major aspect of such an operating system is task placement. Online placement methods are required that achieve a high placement qual...
متن کاملA Comparison of Heuristics for FPGA Placement
Field-Programmable Gate Arrays (FPGAs) are digital integrated circuits (ICs) that contain configurable logic and interconnect to provide a means for fast prototyping and also for a cost-effective chip design. The innovative development of FPGAs spurred the invention of a new field in which many different hardware algorithms could execute on a single device [16]. Efficient Computer Aided Design ...
متن کامل